Minimizing the weighted sum of completion times under processing time uncertainty
نویسندگان
چکیده
منابع مشابه
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights
Given a set of tasks with associated processing times, deadlines and weights unrestricted in sign, we consider the problem of determining a task schedule on one machine by minimizing the sum of weighted completion times. The problem is NP-hard in the strong sense. We present a lower bound based on task splitting, an approximation algorithm, and two exact approaches, one based on branch-and-boun...
متن کاملWeighted sum of completion times
4. Weighted sum of completion times 1 Eugene L. Lawler, Maurice Queyranne, Andreas S. Schulz, David B. Shmoys 4.1. Smith’s ratio rule 2 4.2. Preference orders on jobs 5 4.3. Preference orders on sequences and series-parallel precedence constraints 8 4.4. NP-hardness of further constrained min-sum problems 14 4.5. The ratio rule via linear programming 18 4.6. Approximation algorithms for 1|prec|...
متن کاملThe Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times
We consider a single-machine scheduling problem, in which the processing time of a job can take any value from a given segment. The criterion is to minimize the sum of weighted completion times of the n jobs, a positive weight being associated with a job. For a job permutation, we study the stability box, which is a subset of the stability region. We derive an O(n logn) algorithm for constructi...
متن کاملMinimizing Mean Completion Time in Flowshops with Random Processing Times
RACT : We consider the two-machine flowshop scheduling problem where jobs have random processing times are bounded within certain intervals. The objective is to minimize total completion time of all jobs. The decision of a solution for the problem has to be made based on the lower and upper bounds on job processing times since this only information available. The problem is NP-hard since the sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2018
ISSN: 1571-0653
DOI: 10.1016/j.endm.2018.01.003